Continuous/Discrete Hybrid Convex Optimization and Its Optimality Criterion
نویسندگان
چکیده
منابع مشابه
Optimality conditions in convex optimization revisited
The phrase convex optimization refers to the minimization of a convex function over a convex set. However the feasible convex set need not be always described by convex inequalities. In this article we consider a convex feasible set which are described by inequality constraints which are locally Lipschitz and not necessarily convex and need not be smooth. We show that if the Slater’s constraint...
متن کاملDesigning experiments for robust-optimization problems: the Vs-optimality criterion
We suggest an experimentation strategy for the robust design of empirically fitted models. The suggested approach is used to design experiments that minimize the variance of the optimal robust solution. The new design-of-experiment optimality criterion, termed Vs-optimal, prioritizes the estimation of a model’s coefficients, such that the variance of the optimal solution is minimized by the per...
متن کاملTopological Optimization of Continuum Structures Using Optimality Criterion in ANSYS
2Professor, Department of Mechanical Engineering, G.B.P.U.A.T., Pantnagar, U.S.Nagar, Uttarakhand, India ---------------------------------------------------------------------***--------------------------------------------------------------------Abstract Topology optimization is the most important part of structural optimization which is employed when the design is at the conceptual stage. Gener...
متن کاملε - optimality conditions for composed convex optimization problems
The aim of the present paper is to provide a formula for the ε subdifferential of f +g ◦h different from the ones which can be found in the existent literature. Further we equivalently characterize this formula by using a so-called closedness type regularity condition expressed by means of the epigraphs of the conjugates of the functions involved. Even more, using the ε subdifferential formula ...
متن کاملSparse Recovery by Non-convex Optimization -- Instance Optimality
In this note, we address the theoretical properties of ∆p, a class of compressed sensing decoders that rely on lp minimization with 0 < p < 1 to recover estimates of sparse and compressible signals from incomplete and inaccurate measurements. In particular, we extend the results of Candès, Romberg and Tao [4] and Wojtaszczyk [30] regarding the decoder ∆1, based on l 1 minimization, to ∆p with 0...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Institute of Systems, Control and Information Engineers
سال: 2004
ISSN: 1342-5668,2185-811X
DOI: 10.5687/iscie.17.409